An efficient direct parallel spectral-element solver for separable elliptic problems

نویسندگان

  • Yuen-Yick Kwan
  • Jie Shen
چکیده

An efficient direct parallel elliptic solver based on the spectral element discretization is developed. The direct solver is based on a matrix decomposition approach which reduces multi-dimensional separable problems to a sequence of onedimensional problems that can be efficiently handled by a static condensation process. Thanks to the spectral accuracy and the localized nature of a spectral element discretization, this elliptic solver is spectrally accurate and can be efficiently parallelized, and it can serve as an essential building block for large scale high-performance solvers in computational fluid dynamics and computational materials science. 2007 Elsevier Inc. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Iterative Substructuring Methods for Spectral Element Discretizations of Elliptic Systems I: Compressible Linear Elasticity

An iterative substructuring method for the system of linear elasticity in three dimensions is introduced and analyzed. The pure displacement formulation for compressible materials is discretized with the spectral element method. The resulting stiiness matrix is symmetric and positive deenite. The method proposed provides a domain decomposition preconditioner constructed from local solvers for t...

متن کامل

Efficient Parallel Preconditioners for High-Order Finite Element Discretizations of H(grad) and H(curl) Problems

In this paper, we study preconditioning techniques for both H(grad) and H(curl) problems. For an H(grad) elliptic problem discretized by high-order finite elements with a hierachical basis of k-th order, we design and analyse an parallel AMG preconditioner based on a two-level method and a block Gauss–Seidel smoothing technique. For an H(curl) elliptic problem discretized by high-order edge fin...

متن کامل

Efficient spectral-Galerkin methods for fractional partial differential equations with variable coefficients

Efficient Spectral-Galerkin algorithms are developed to solve multi-dimensional fractional elliptic equations with variable coefficients in conserved form as well as non-conserved form. These algorithms are extensions of the spectral-Galerkin algorithms for usual elliptic PDEs developed in [24]. More precisely, for separable FPDEs, we construct a direct method by using a matrix diagonalization ...

متن کامل

Parallel Implementation of fast Elliptic Solver

A fast elliptic solver for separable elliptic equations on rectangular domains is considered. The method is referred to as FASV (fast algorithm for separation of variables) and is based on the odd-even block elimination technique in combination with the method for discrete separation of variables. The algorithm is connected with solving systems of algebraic equations with sparsity whose right-h...

متن کامل

A Parallel Fast Direct Solver for the Discrete Solution of Separable Elliptic Equations

A parallel fast direct solver based on the Divide & Conquer method is considered for linear systems with separable block tridiagonal matrices. Such systems are obtained, for example, by discretizing the two{dimensional Poisson equation posed on rectangular domains with the continuous piecewise linear nite elements on nonuniform triangulated rectangular meshes. The Divide & Conquer method has th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Comput. Physics

دوره 225  شماره 

صفحات  -

تاریخ انتشار 2007